Evaluation of coarse-grained mapping schemes for polysaccharide chains in cellulose
نویسندگان
چکیده
منابع مشابه
Evaluation of coarse-grained mapping schemes for polysaccharide chains in cellulose.
A fundamental understanding of the intermolecular forces that bind polysaccharide chains together in cellulose is crucial for designing efficient methods to overcome the recalcitrance of lignocellulosic biomass to hydrolysis. Because the characteristic time and length scales for the degradation of cellulose by enzymatic hydrolysis or chemical pretreatment span orders of magnitude, it is importa...
متن کاملMapping of Coarse - Grained
We present an environment for connguring and coordinating coarse grained parallel applications on workstation clusters. The environment named CoPA is based on PVM and allows an automatic distribution of functional modules as they occur in typical CAE-applications. By implementing link-based communication on top of PVM, CoPA is able to perform a \post-game" analysis of the communication load bet...
متن کاملDiscretizing elastic chains for coarse-grained polymer models
Studying the statistical and dynamic behavior of semiflexible polymers under complex conditions generally requires discretizing the polymer into a sequence of beads for purposes of simulation. We present a novel approach for generating coarse-grained, discretized polymer models designed to reproduce the polymer statistics at intermediate to long lengths. Our versatile model allows for an arbitr...
متن کاملEvaluation of coarse grained models for hydrogen bonds in proteins
Backbone hydrogen bonds contribute very importantly to the stability of proteins and therefore they must be appropriately represented in protein folding simulations. Simple models are frequently used in theoretical approaches to this process, but their simplifications are often confronted with the need to be true to the physics of the interactions. Here we study the effects of different levels ...
متن کاملGreedy Algorithms for Mapping onto a Coarse-grained Reconfigurable Fabric
This book chapter describes several greedy heuristics for mapping large data-flow graphs (DFGs) onto a stripe-based coarse-grained reconfigurable fabric. These DFGs represent the behavior of an application kernel in a high-level synthesis flow to convert computer software into custom computer hardware. The first heuristic is a limited lookahead greedy approach that provides excellent run times ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2013
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.4808025